Enhanced Traffic Grooming in WDM Mesh Networks using Lighttours

نویسندگان

  • Fernando Solano
  • Luis F. Caro
  • Jaudelice C. de Oliveira
  • Ramon Fabregat
  • Jose Luis Marzo
  • Jose L. Marzo
چکیده

In this article, a new technique for grooming low-speed traffic demands into high-speed optical routes is proposed. This enhancement allows a transparent WavelengthRouting Switch (WRS) to aggregate traffic en route over existing optical routes without incurring expensive Optical-ElectricalOptical (OEO) conversions. This implies that: a) an optical route may be considered as having more than one ingress node (all inline) and, b) traffic demands can partially use optical routes to reach their destination. The proposed optical routes are named “lighttours” since the traffic originating from different sources can be forwarded together in a single optical route, i.e., as taking a “tour” over different sources towards the same destination. The possibility of creating lighttours is the consequence of a novel WRS architecture proposed in this article, named “Enhanced Grooming” (G). The ability to groom more traffic in the middle of a lighttour is achieved with the support of a simple optical device named λ-monitor (previously introduced in the RingO project). In this article, we present the new WRS architecture and its advantages. To compare the advantages of lighttours with respect to classical lightpaths, an Integer Linear Programming (ILP) model is proposed for the well-known multilayer problem: Traffic Grooming, Routing and Wavelength Assignment. The ILP model may be used for several objectives. However, this article focuses on two objectives: maximizing the network throughput, and minimizing the number of Optical-Electro-Optical conversions used. Experiments show that G can route all the traffic using only half of the total OEO conversions needed by classical grooming. An heuristic is also proposed, aiming at achieving near optimal results in polynomial time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Traffic Grooming using Fixed-Alternate Routing in WDM Mesh Optical Networks

There is a mismatch between lightpath channel capacity and traffic request capacity in wavelength division multiplexed (WDM) optical mesh networks. Traffic grooming is needed to resolve this mismatch in an efficient way. We study the dynamic traffic grooming problem in WDM mesh networks using the fixed-alternate routing (FAR) approach. Based on the FAR approach, we propose the fixed-order groom...

متن کامل

Dynamic Multicast Traffic Grooming in WDM Networks with Reconfigurable Light-trees

We address the traffic grooming problem in WDM mesh networks with dynamic multicast traffic. We develop a grooming algorithm in which light-trees can dynamically be reconfigured when a new route is established. c © 2004 Optical Society of America OCIS codes: (060.4250) Networks

متن کامل

A Dynamic Traffic Grooming Algorithm in Multi-granularity Heterogeneous Optical WDM Mesh Networks

We consider the problem of traffic grooming in wavelength division multiplexing networks. Our objective is to minimize the required number of electronic add-drop multiplexers. We investigate the problem of efficiently provisioning connections of different bandwidth granularities in a heterogeneous WDM mesh network through dynamic traffic grooming schemes under traffic engineering principles. We...

متن کامل

Traffic grooming in an optical WDM mesh network

In wavelength-division multiplexing (WDM) optical networks, the bandwidth request of a traffic stream can be much lower than the capacity of a lightpath. Efficiently grooming low-speed connections onto high-capacity lightpaths will improve the network throughput and reduce the network cost. In WDM/SONET ring networks, it has been shown in the optical network literature that by carefully groomin...

متن کامل

Dynamic traffic grooming in WDM mesh networks using a novel graph model

As our fiber-optic backbone networks migrate from interconnected SONET rings to arbitrary mesh topology, traffic grooming on WDM mesh networks becomes an extremely important research problem. (Traffic grooming refers to the problem of efficiently packing a set of low-speed connection requests onto high-capacity channels.) To address this problem, we employ a new, generic graph model for dynamic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007